Loop-free sequent calculus for modal logic K4
نویسندگان
چکیده
منابع مشابه
A Modal Sequent Calculus for Propositional Separation Logic
In this paper, we give a sequent calculus for separation logic. Unlike the logic of bunched implications, this calculus does not have a tree-shaped context – instead, we use labelled deduction to control when hypotheses can and cannot be used. We prove that cut-elimination holds for this calculus, and show that it is sound with respect to the provability semantics of separation logic.
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not immediatel...
متن کامل0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †
Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not well-suite...
متن کاملA Contraction-Free Focused Sequent Calculus for Classical Propositional Logic
Existing focused proof systems for classical and intuitionistic logic allow contraction for exactly those formulas chosen for focus. For proof-search applications, contraction is undesirable, as we risk traversing the same path multiple times. We present here a contraction-free focused sequent calculus for classical propositional logic, called LKFCF, which is a modification of the recently deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2009
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.2009.43